First-Order Proof Theory of Arithmetic
نویسنده
چکیده
منابع مشابه
Arithmetic Deformation Theory of Lie Algebras
This paper is devoted to deformation theory of graded Lie algebras over Z or Zl with finite dimensional graded pieces. Such deformation problems naturally appear in number theory. In the first part of the paper, we use Schlessinger criteria for functors on Artinian local rings in order to obtain universal deformation rings for deformations of graded Lie algebras and their graded representations...
متن کاملA Note on the First Geometric-Arithmetic Index of Hexagonal Systems and Phenylenes
The first geometric-arithmetic index was introduced in the chemical theory as the summation of 2 du dv /(du dv ) overall edges of the graph, where du stand for the degree of the vertex u. In this paper we give the expressions for computing the first geometric-arithmetic index of hexagonal systems and phenylenes and present new method for describing hexagonal system by corresponding a simple g...
متن کاملEfficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
Deduction modulo is a paradigm which consists in applying the inference rules of a deductive system—such as for instance natural deduction—modulo a rewrite system over terms and propositions. It has been shown that higher-order logic can be simulated into the first-order natural deduction modulo. However, a theorem stated by Gödel and proved by Parikh expresses that proofs in second-order arith...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملA Formal Derivation of the Decidability of the Theory SA
Hosono, C. and Y. Ikeda, A formal derivation of the decidability of the theory SA, Theoretical Computer Science 127 (1994) l-23. A formal definition of a first-order theory SA, which is an extension of Presburger arithmetic to rational numbers, is introduced and syntactic proof of the decidability of SA is given. This proof has already been outlined by Smorynski, but this work is independent of...
متن کامل